Vertex Algebroids I
نویسنده
چکیده
منابع مشابه
On certain vertex algebras and their modules associated with vertex algebroids
We study the family of vertex algebras associated with vertex algebroids, constructed by Gorbounov, Malikov, and Schechtman. As the main result, we classify all the (graded) simple modules for such vertex algebras and we show that the equivalence classes of graded simple modules one-to-one correspond to the equivalence classes of simple modules for the Lie algebroids associated with the vertex ...
متن کاملTwisted modules for vertex algebras associated with vertex algebroids
We continue with [LY] to construct and classify graded simple twisted modules for the N-graded vertex algebras constructed by Gorbounov, Malikov and Schechtman from vertex algebroids. Meanwhile we determine the full automorphism groups of those N-graded vertex algebras in terms of the automorphism groups of the corresponding vertex algebroids.
متن کامل2 Paul Bressler
The purpose of this note is to give a “coordinate free” construction and prove the uniqueness of the vertex algebroid which gives rise to the chiral de Rham complex of [GMS]. In order to do that, we adapt the strategy of [BD] to the setting of vertex agebroids. To this end we show that the stack EVAX of exact vertex algebroids on X is a torsor under the stack in Picard groupoids ECAX of exact C...
متن کاملVertex Algebroids Ii
In this note we determine the obstruction to triviality of the stack of exact vertex algebroids thereby recovering the result of [GMS]. The stack EVAOX of exact vertex OX-algebroids is a torsor under the stack in Picard groupoids ECAOX of exact Courant OX -algebroids. The latter is equivalent to the stack of torsors under ΩX −→Ω . Therefore, ECAOX -torsors are classified by H (X; ΩX −→Ω ). The ...
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کامل